Van-based robot hybrid pickup and delivery routing problem

We present a two-echelon van-based robot last-mile pickup and delivery system in urban settings. Robots can visit areas with van access restrictions, such as pedestrianized or university campuses. The stops at parking nodes to drop off and/or pick up its robot, replenish swap robot’s battery if needed. Five van/robot cases are considered, according the roles plays process of pickup/delivery whether transports robot. To model proposed problem, we introduce mixed-integer program including time, freight, energy. further propose an adaptive large neighborhood search algorithm solve larger instances capacity feasibility test approach for single route. then assess influence node density on output. A case study based realistic city scenario is introduced. sensitivity analysis performed travel cost maximum distances, effect no-go studied. Two classical models (two-echelon vehicle routing hybrid parallel scheduling delivery) compared ours, results show our competitive appropriate therefore advocate using areas.